A Fully Abstract Denotational Model for Observational Precongruence
نویسندگان
چکیده
A domain theoretical denotational model is given for a simple sublan-guage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.
منابع مشابه
A Fully Abstract Denotational Model for Observational Congruence
A domain theoretical denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.
متن کاملObservable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...
متن کاملRelating Semantic Models for the Object Calculus Preliminary Report
Abadi and Cardelli have investigated several versions of the object calculus, a calculus for describing central features of object-oriented programs, with particular emphasis on various type systems. In this paper we study the properties of a denotational semantics due to Abadi and Cardelli vis-à-vis the notion of observational congruence for the calculus Ob1<:μ. In particular, we prove that th...
متن کاملOn the Semantics of the Bad-Variable Constructor in Algol-like Languages
The fully abstract games model of Reynolds’s Idealized Algol is adapted to provide a characterization of the language without the “bad variable constructor” mkvar. The model shows that the addition of mkvar to the language is conservative for observational equivalence but not for the observational preorder.
متن کاملDecidability in Syntactic Control of Interference
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By associating denotations of terms in an inequationally fully abstract model of finitary basic SCI with multitape finite state automata, we show that observational approximation is not decidable (even at first order), but that observational equivalence is decidable for a...
متن کامل